منابع مشابه
An Improved lower bound for arithmetic regularity
The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemeredi regularity lemma in graph theory. It shows that for any abelian group G and any bounded function f : G → [0, 1], there exists a subgroup H ≤ G of bounded index such that, when restricted to most cosets of H, the function f is pseudorandom in the sense that all its nontrivial Fourier coefficients are ...
متن کاملAn improved lower bound for (1,
We call a subset C of vertices of a graph G a (1,≤ l)-identifying code if for all subsets X of vertices with size at most l, the sets {c ∈ C|∃u ∈ X, d(u, c) ≤ 1} are distinct. The concept of identifying codes was introduced in 1998 by Karpovsky, Chakrabarty and Levitin. Identifying codes have been studied in various grids. In particular, it has been shown that there exists a (1,≤ 2)-identifying...
متن کاملAn Improved Lower Bound for Approximating CVP
This paper shows the problem of nding the closest vector in an n-dimensional lattice to be NP-hard to approximate to within factor n c= log log n for some constant c > 0.
متن کاملAn Improved Lower Bound for Crossing Numbers
The crossing number of a graph G = (V,E), denoted by cr(G), is the smallest number of edge crossings in any drawing of G in the plane. Leighton [14] proved that for any n-vertex graph G of bounded degree, its crossing number satisfies cr(G) + n = Ω(bw(G)), where bw(G) is the bisection width of G. The lower bound method was extended for graphs of arbitrary vertex degrees to cr(G)+ 1 16 ∑ v∈G d 2...
متن کاملAn Improved Lower Bound for Folkman’s Theorem
Folkman’s theorem asserts that for each k ∈ N, there exists a natural number n = F (k) such that whenever the elements of [n] are two-coloured, there exists a set A ⊂ [n] of size k with the property that all the sums of the form ∑ x∈B x, where B is a nonempty subset of A, are contained in [n] and have the same colour. In 1989, Erdős and Spencer showed that F (k) ≥ 2ck2/ log , where c > 0 is an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2019
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2019.05.002